“ Extreme Programming ” in a Bioinformatics Class

نویسندگان

  • Scott Kelley
  • Christianna Alger
  • Douglas Deutschman
چکیده

The importance of Bioinformatics tools and methodology in modern biological research underscores the need for robust and effective courses at the college level. This paper describes such a course designed on the principles of cooperative learning based on a computer software industry production model called ―Extreme Programming‖ (EP). The classroom version of EP included: working in pairs, switching roles between labs, partner interdependence and individual accountability. New pairings were created at random each week and at the completion of each lab, students (n=18) indicated their satisfaction and frustration levels with working with partners, the materials, and the technology. We used a Repeated Measures-ANOVA (RM-ANOVA) statistical design to provide statistical power with a modest number of subjects. Students consistently rated working with a pair highest in terms of both ease and satisfaction, regardless of prior programming and technology experience. We found no differences in reported ease or satisfaction between undergraduate and graduate students, or between students with prior experience with technology. Surprisingly, we found that students rated the more difficult computer programming part of the course higher than the web-based exercises. The Extreme Programming cooperative model appears to be very appropriate for Bioinformatics classes, and can be easily implemented in computational labs to enhance student satisfaction and potentially maximize the use of computer workstations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem

A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...

متن کامل

Crafting, Crafting, Crafting - Extreme Programming in Classroom?

Extreme Programming (XP) shows several interesting approaches which are very attractive for education. It is centered around early and incremental creation of working software. In the following, the chances XP offers for class are shown – especially for use in a class project, but also for practical phases in all lessons where programming is useful. Finally several common problems which can occ...

متن کامل

Contribution to Extreme Value Theory with Applications in Bioinformatics

This thesis presents results in Extreme Value Theory with application to Bioinformatics. First, we obtain the asymptotic behavior of the probability of high level excursions for the maximum of the Wiener process increments, followed by the normalization sequence for the corresponding limiting Gumbel distribution. Next, we consider the Shepp statistics for Gaussian random walk and establish asym...

متن کامل

I-40: Male Genome Programming, Infertility and Cancer

Background: During male germ cells differentiation, genomewide re-organizations and highly specific programming of the male genome occur. These changes not only include the large-scale meiotic shuffling of genes, taking place in spermatocytes, but also a complete “re-packaging” of the male genome in post meiotic cells, leading to a highly compacted nucleo-protamine structure in the mature sperm...

متن کامل

gpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences

Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010